A lower bound for the double slice genus
نویسندگان
چکیده
In this paper, we develop a lower bound for the double slice genus of knot in 3-sphere using Casson-Gordon invariants. As an application, show that difference between and can be arbitrarily large. analogue to genus, also define superslice knot, give both upper bound. particular, through study degree Alexander polynomial is topological ribbon knot.
منابع مشابه
A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملA lower bound for ...
Let A and B be two finite subsets of a field F. In this paper we provide a nontrivial lower bound for |{a + b: a ∈ A, b ∈ B, and P (a, b) 6= 0}| where P (x, y) ∈ F[x, y].
متن کاملA Lower Bound for
It is proved that there is a monotone function in AC(0) 4 which requires exponential size monotone perceptrons of depth 3. This solves the monotone version of a problem which, in the general case, would imply an oracle separation of PPPH.
متن کاملA New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2021
ISSN: ['2330-0000']
DOI: https://doi.org/10.1090/tran/8191